On Some Global Operations in Faulty SIMD Hypercubes

In this paper we extend our prior results to obtain algorithms for performing all-to-all broadcast, global sum and broadcast operation in an N = 2 node n dimensional faulty SIMD hypercube, Qn, (n 9) with the number of faults n 1 < f 2n 3 . We also discuss optimal algorithms for one-to-all personalized broadcasting and all-toone personalized broadcasting in a Qn with the number of faults f n 1. Our broadcasting and global sum algorithms require 2n+19 steps andn+O(log n) steps whereas the all-to-all broadcast algorithm requires 10N+15 steps.